منابع مشابه
Dynamic weighted voting games
We initiate the study of dynamic cooperative games—cooperative games where the characteristic function may change over time. We introduce two types of algorithmic problems for such games: computing a given solution concept at time t, and checking that a certain function of the game (e.g., the Shapley value of a given player or the value of the least core) remains within given bounds during time...
متن کاملReliability Weighted Voting Games
We examine agent failures in weighted voting games. In our cooperative game model, R-WVG, each agent has a weight and a survival probability, and the value of an agent coalition is the probability that its surviving members would have a total weight exceeding a threshold. We propose algorithms for computing the value of a coalition, finding stable payoff allocations, and estimating the power of...
متن کاملRoughly Weighted Hierarchical Simple Games
Hierarchical simple games both disjunctive and conjunctive are natural generalizations of simple majority games. They take their origin in the theory of secret sharing. Another important generalization of simple majority games with origin in economics and politics are weighted and roughly weighted majority games. In this paper we characterize roughly weighted hierarchical games identifying wher...
متن کاملStructural Control in Weighted Voting Games
Inspired by the study of control scenarios in elections and complementing manipulation and bribery settings in cooperative games with transferable utility, we introduce the notion of structural control in weighted voting games. We model two types of influence, adding players to and deleting players from a game, with goals such as increasing a given player’s Shapley–Shubik or probabilistic Penro...
متن کاملShapley values in random weighted voting games
Shapley values, also known as Shapley–Shubik indices, measure the power that agents have in a weighted voting game. Suppose that agent weights are chosen randomly according to some distribution. We show that the expected Shapley values for the smallest and largest agent are independent of the quota for a large range of quotas, and converge exponentially fast to an explicit value depending only ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2018
ISSN: 1556-5068
DOI: 10.2139/ssrn.3174301